Guess and Determine Attack on Bivium
نویسندگان
چکیده
منابع مشابه
Guess and Determine Attack on Bivium
Bivium is a simplified version of Trivium, a hardware profile finalist of the eSTREAM project. Bivium has an internal state size of 177 bits and a key length of 80 bits. In this paper, a guess and determine attack on this cipher is introduced. In the proposed method, the best linear approximations for the updating functions are first defined. Then by using these calculated approximations, a sys...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملA New Guess-and-Determine Attack on the A5/1
In Europe and North America, the most widely used stream cipher to ensure privacy and confidentiality of conversations in GSM mobile phones is the A5/1. In this paper, we present a new attack on the A5/1 stream cipher with a minimum time complexity of around 2 and an average complexity of 2, which is much less than the brute-force attack with a complexity of 2. The attack has a 100% success rat...
متن کاملGuess-and-Determine Algebraic Attack on the Self-Shrinking Generator
In this paper we propose a new guess-and-determine attack on the self-shrinking generator (SSG), proposed by Meier and Staffelbach at Eurocrypt’94. The main idea of our attack consists in guessing some information about the internal bitstream of SSG, and expressing this information by a system of polynomial equations on the still unknown key bits. From a practical point of view, we show that us...
متن کاملNew Guess-and-Determine Attack on the Self-Shrinking Generator
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack conditions and requirements smoothly. For the SSG with a length L LFSR of arbitrary form, our attack can reliably restore the initial state with time complexity O(2), memory complexity O(L) from O(2)-bit keystream for L ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing Systems
سال: 2011
ISSN: 1976-913X
DOI: 10.3745/jips.2011.7.1.151